An algebraic framework for end-to-end physical-layer network coding

نویسندگان

  • Elisa Gorla
  • Alberto Ravagnani
چکیده

We propose an algebraic setup for end-to-end physical-layer network coding based on submodule transmission. We introduce a distance function between modules, describe how it relates to information loss and errors, and show how to compute it. Then we propose a definition of submodule error-correcting code, and investigate bounds and constructions for such codes. Introduction and motivation In the framework of physical-layer network coding (PNC) multiple terminals attempt to exchange messages through intermediate relays. The relays collect data from the terminals, and try to decode a function of the transmitted messages. Such function is then broadcasted to the terminals, which combine it with their side information to recover the other messages. In [11] the authors proposed a novel approach to PNC based on nested lattices, known as “compute-and-forward”. Under this approach, the structure of a fixed underlying lattice is exploited by the relays to decode the function of the messages, which is then forwarded to the terminals. As observed in [5], this communication scheme induces an end-to-end network coding channel with channel equation Y = AX + Z. (1) Here X is the transmitted matrix, whose rows are elements from a given ambient space Ω, A is a transfer matrix, and Z is an error matrix. In practice, A and Z are random matrices drawn according to certain distributions, that depend on the application at hand. A general algebraic framework to study and construct nested-lattice-based PNC schemes was recently proposed in [5] and further developed in [4]. Following this algebraic description, which is compatible with any underlying lattice, the message space Ω has the structure of a module over a principal ideal ring Ω = T/(d1)× T/(d2)× . . .× T/(dn), where T ⊆ C is a principal ideal domain (PID), d1, d2..., dn ∈ T are nonzero, non-invertible elements, and dn|dn−1| . . . |d1. Let R = T/(d1), then R is a principal ideal ring (PIR). The ambient space Ω is isomorphic to an R-submodule of Rn: Ω ∼= R× (d1/d2)× . . . × (d1/dn) ⊆ R . (2) E-mail addresses: [email protected], [email protected]. The authors were partially supported by the Swiss National Science Foundation through grant no. 200021 150207.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Coding Subgraph Selection under Survivability Constraint

Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets recei...

متن کامل

A Novel Spectrally-Efficient Scheme for Physical Layer Network Coding

In this paper, we propose a novel three-time-slot transmission scheme combined with an efficient embedded linear channel equalization (ELCE) technique for the Physical layer Network Coding (PNC). Our transmission scheme, we achieve about 33% increase in the spectral efficiency over the conventional two-time-slot scheme while maintaining the same end-toend BER performance. We derive an exact exp...

متن کامل

Network Coding for Wireless Networks

Network coding refers to a scheme where a node is allowed to generate output data by mixing (i.e., computing certain functions of) its received data. The unique characteristics of wireless medium renders network coding particularly useful. For instance, network coding can be used to achieve the minimum energy-per-bit for multicasting in a wireless ad hoc network. In addition to optimizing energ...

متن کامل

Nonbinary Coding: Towards a Unified Framework Across Multiple Layers

In addition to the invention of iterative decoded capacity-achieving channel coding schemes, namely, turbo codes in the early 1990’s and the rediscovery of low-density parity-check (LDPC) codes in the mid 1990’s, digital fountain codes and network coding are two recent breakthroughs in the coding community. They offer great promise for providing robust and efficient data transport through a lar...

متن کامل

Algebraic Approach to Physical-Layer Network Coding

The problem of designing physical-layer network coding (PNC) schemes via nested lattices is considered. Building on the compute-and-forward (C&F) relaying strategy of Nazer and Gastpar, who demonstrated its asymptotic gain using information-theoretic tools, an algebraic approach is taken to show its potential in practical, non-asymptotic, settings. A general framework is developed for studying ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1611.04226  شماره 

صفحات  -

تاریخ انتشار 2016